Quantum Multi-Agent Meta Reinforcement Learning

نویسندگان

چکیده

Although quantum supremacy is yet to come, there has recently been an increasing interest in identifying the potential of machine learning (QML) looming era practical computing. Motivated by this, this article we re-design multi-agent reinforcement (MARL) based on unique characteristics neural networks (QNNs) having two separate dimensions trainable parameters: angle parameters affecting output qubit states, and pole associated with measurement basis. Exploiting dyadic trainability as meta-learning capability, propose meta MARL (QM2ARL) that first applies training for meta-QNN learning, followed few-shot or local-QNN training. To avoid overfitting, develop angle-to-pole regularization technique injecting noise into domain during Furthermore, exploiting memory address each trained QNN, introduce concept allowing one save load QNNs using only two-parameter values. We theoretically prove convergence under regularization, simulation corroborate effectiveness QM2ARL achieving high reward fast convergence, well adaptation a time-varying environment.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Agent Reinforcement Learning

This thesis presents a novel approach to provide adaptive mechanisms to detect and categorise Flooding-Base DoS (FBDoS) and Flooding-Base DDoS (FBDDoS) attacks. These attacks are generally based on a flood of packets with the intention of overfilling key resources of the target, and today the attacks have the capability to disrupt networks of almost any size. To address this problem we propose ...

متن کامل

Meta-game Equilibrium for Multi-agent Reinforcement Learning

This paper proposes a multi-agent Q-learning algorithm called meta-game-Q learning that is developed from the meta-game equilibrium concept. Different from Nash equilibrium, meta-game equilibrium can achieve the optimal joint action game through deliberating its preference and predicting others’ policies in the general-sum game. A distributed negotiation algorithm is used to solve the meta-game...

متن کامل

Multi-Agent Deep Reinforcement Learning

This work introduces a novel approach for solving reinforcement learning problems in multi-agent settings. We propose a state reformulation of multi-agent problems in R that allows the system state to be represented in an image-like fashion. We then apply deep reinforcement learning techniques with a convolution neural network as the Q-value function approximator to learn distributed multi-agen...

متن کامل

Multi-agent Relational Reinforcement Learning

In this paper we study Relational Reinforcement Learning in a multi-agent setting. There is growing evidence in the Reinforcement Learning research community that a relational representation of the state space has many benefits over a propositional one. Complex tasks as planning or information retrieval on the web can be represented more naturally in relational form. Yet, this relational struct...

متن کامل

Reinforcement Learning in Cooperative Multi–Agent Systems

Reinforcement Learning is used in cooperative multi–agent systems differently for various problems. We provide a review on learning algorithms used for repeated common–payoff games, and stochastic general– sum games. Then these learning algorithms is compared with another algorithm for the credit assignment problem that attempts to correctly assign agents the awards that they deserve.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i9.26313